Editing to a connected graph of given degrees
نویسندگان
چکیده
منابع مشابه
Editing to a Connected Graph of Given Degrees
The aim of edge editing or modification problems is to change a given graph by adding and deleting of a small number of edges in order to satisfy a certain property. We consider the Edge Editing to a Connected Graph of Given Degrees problem that for a given graph G, non-negative integers d, k and a function δ : V (G) → {1, . . . , d}, asks whether it is possible to obtain a connected graph G′ f...
متن کاملEditing to a Graph of Given Degrees
We consider the Editing to a Graph of Given Degrees problem that asks for a graph G, non-negative integers d, k and a function δ : V (G) → {1, . . . , d}, whether it is possible to obtain a graph G from G such that the degree of v is δ(v) for any vertex v by at most k vertex or edge deletions or edge additions. We construct an FPT-algorithm for Editing to a Graph of Given Degrees parameterized ...
متن کاملEditing to a Planar Graph of Given Degrees
We consider the following graph modification problem. Let the input consist of a graph G = (V,E), a weight function w : V ∪E → N, a cost function c : V ∪E → N and a degree function δ : V → N0, together with three integers kv, ke and C. The question is whether we can delete a set of vertices of total weight at most kv and a set of edges of total weight at most ke so that the total cost of the de...
متن کاملGraph Editing to a Given Degree Sequence
We investigate the parameterized complexity of the graph editing problem called Editing to a Graph with a Given Degree Sequence, where the aim is to obtain a graph with a given degree sequence σ by at most k vertex or edge deletions and edge additions. We show that the problem is W[1]-hard when parameterized by k for any combination of the allowed editing operations. From the positive side, we ...
متن کاملEditing to Connected f-Degree Graph
In the Edge Editing to Connected f-Degree Graph problem we are given a graph G, an integer k and a function f assigning integers to vertices of G. The task is to decide whether there is a connected graph F on the same vertex set as G, such that for every vertex v, its degree in F is f(v) and the number of edges in E(G)4E(F ), the symmetric difference of E(G) and E(F ), is at most k. We show tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2017
ISSN: 0890-5401
DOI: 10.1016/j.ic.2017.04.013